منابع مشابه
Binary Partitions Revisited
The restricted binary partition function bk(n) enumerates the number of ways to represent n as n = 2a0 + 2a1 + · · ·+ 2aj with 0 ≤ a0 ≤ a1 ≤ . . . ≤ aj < k. We study the question of how large a power of 2 divides the difference bk(2n) − bk−2(2n) for fixed k ≥ 3, r ≥ 1, and all n ≥ 1.
متن کاملP-partitions revisited
We compare a traditional and non-traditional view on the subject of P-partitions, leading to formulas counting linear extensions of certain posets.
متن کاملBinary Space Partitions
Binary Space Partitions Name: Adrian Dumitrescu, Csaba D. Tóth Affil./Addr. 1: Computer Science, Univ. of Wisconsin–Milwaukee, Milwaukee, WI, USA Affil./Addr. 2: Mathematics, California State University Northridge, Los Angeles, CA, USA Affil./Addr. 3: Computer Science, Tufts University, Medford, MA, USA
متن کاملTheory of Principal Partitions Revisited
The theory of principal partitions of discrete systems such as graphs, matrices, matroids, and submodular systems has been developed since 1968. In the early stage of the developments during 1968–75 the principal partition was considered as a decomposition of a discrete system into its components together with a partially ordered structure of the set of the components. It then turned out that s...
متن کاملBinary Space Partitions: Recent Developments
A binary space partition tree is a data structure for the representation of a set of objects in space. It found an increasing number of applications over the last decades. In recent years, intensifying research focused on its combinatorial properties, which affect directly the efficiency of applications. Important advances were made on binary space partitions for disjoint line segments in the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2002
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3223